Arithmetic Cryptography

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Arithmetic Behind Cryptography

T he security of very efficient and widely used public key crypto systems is based on the hardness of mathematical problems. Typically such problems come from arithmetic. Here are three important examples: Find shortest or closest vectors in lattices, factor large numbers, and compute logarithms in finite groups. In this article we shall concentrate on the last example and so cover crypto syste...

متن کامل

Bounded Arithmetic, Cryptography and Complexity

This survey discusses theories of bounded arithmetic, growth rates of definable functions, natural proofs, interpolation theorems, connections to cryptography, and the difficulty of obtaining independence results.

متن کامل

Tamper-Resistant Arithmetic for Public-Key Cryptography

Cryptographic hardware has found many uses in ubiquitous and pervasive security devices with a small form factor, e.g. SIM cards, smart cards, electronic security tokens, and soon even RFIDs. With applications in banking, telecommunication, healthcare, ecommerce and entertainment, these devices use cryptography to provide security services like authentication, identification and confidentiality...

متن کامل

Efficient Unified Arithmetic for Hardware Cryptography

The basic arithmetic operations (i.e. addition, multiplication, and inversion) in finite fields, GF (q), where q = p k and p is a prime integer, have several applications in cryptography, such as RSA algorithm, Diffie-Hellman key exchange algorithm [1], the US federal Digital Signature Standard [2], elliptic curve cryptography [3, 4], and also recently identity based cryptography [5, 6]. Most p...

متن کامل

Arithmetic Coding and Blinding for Lattice Cryptography

In this work we apply information theoretically optimal arithmetic coding and a number of novel side-channel blinding countermeasure techniques to create BLZZRD, a practical, compact, and more quantum-resistant variant of the BLISS Ring-LWE Signature Scheme. We show how the hash-based random oracle can be modified to be more secure against quantum preimage attacks while decreasing signature siz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the ACM

سال: 2017

ISSN: 0004-5411,1557-735X

DOI: 10.1145/3046675